Section: Software

gf2x

Participants : Pierrick Gaudry, Emmanuel Thomé [contact] , Paul Zimmermann.

gf2x is a software library for polynomial multiplication over the binary field, developed together with Richard Brent (Australian National University, Canberra, Australia). It holds state-of-the-art implementation of fast algorithms for this task, employing different algorithms in order to achieve efficiency from small to large operand sizes (Karatsuba and Toom-Cook variants, and eventually Schönhage's or Cantor's FFT-like algorithms). gf2x takes advantage of specific processors instruction (SSE, PCLMULQDQ).

The current version of gf2x is 1.0, released in 2010 under the GNU GPL. Since 2009, gf2x can be use as an auxiliary package for the widespread software library Ntl , as of version 5.5.

There has been no update of gf2x in 2011, but the software is still maintainted. An LGPL-licensed portion of gf2x is also part of the Cado-nfs software package.